Global Duality, Signature Calculus and the Discrete Logarithm Problem
نویسندگان
چکیده
منابع مشابه
Global Duality, Signature Calculus and the Discrete Logarithm Problem
We study the discrete logarithm problem for the multiplicative group and for elliptic curves over a finite field by using a lifting of the corresponding object to an algebraic number field and global duality. We introduce the signature of a Dirichlet character (in the multiplicative group case) or principal homogeneous space (in the elliptic curve case), which is a measure of the ramification a...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملSignature Calculus and the Discrete Logarithm Problem for Elliptic Curves (Preliminary Version)
This is the third in a series of papers in which we develop a unified method for treating the discrete logarithm problem (DLP) in various contexts. In [HR1], we described a formalism using global duality for a unified approach to the DLP for the multiplicative group and for elliptic curves over finite fields. The main tool to be employed is what we call signature calculus. In [HR2], we used sig...
متن کاملThe Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem
Let E=F p be an elliptic curve deened over a nite eld, and let S;T 2 E(F p) be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks to nd an integer m so that S = mT in E(F p). In this note we give a new algorithm, dubbed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2009
ISSN: 1461-1570
DOI: 10.1112/s1461157000001509